#include "queue.h"
int main()
{
int n = 8;
QueuePtr Q = InitQueue(); //初始化
int s = 0, t;
EnQueue(Q, 0);//入队
EnQueue(Q, 1);
printf(" 1");
putchar('\n');
for (int i = 2; i <= n; i++)
{
for (int m = (n - i); m > 0; m--)
printf(" ");
EnQueue(Q, 0);
for (int j = 1; j <= i; j++)
{
DeQueue(Q, &t);删除队头元素并赋值给t
s = GetHead(Q);//返回队头元素
printf("%2d ", s + t);
EnQueue(Q, s + t);
}
putchar('\n');
}
system("pause");
return 0;
}
队列输出杨辉三角
最新推荐文章于 2022-12-31 13:20:59 发布